Computational Complexity of Generators and Nongenerators in Algebra
نویسندگان
چکیده
We discuss the computational complexity of several problems concerning subsets of an algebraic structure that generate the structure. We show that the problem of determining whether a given subset X generates an algebra A is P-complete, while determining the size of the smallest generating set is NP-complete. We also consider several questions related to the Frattini subuniverse, Φ(A), of an algebra A. We show that the membership problem for Φ(A) is co-NP-complete, while the membership problems for Φ(Φ(A)), Φ(Φ(Φ(A))),... all lie in the class P‖(NP). In the analysis of any algebraic structure, determining those subsets that generate the structure frequently plays a key role. This is evident in linear algebra for example, where the discussion of bases and spanning sets forms a central element of the subject. The same is true in other branches of algebra such as group and lattice theory. Knowledge of the generating subsets of an algebra gives us information on its subalgebras, homomorphic images, automorphism group etc. As computer algebra systems become commonplace in the toolboxes of scientists (see for example GAP [11], and the “algebra calculator” [21]), questions of efficiency in the determination of generating subsets arise. In this paper we address this fundamental issue by providing completeness results for several variants of the basic question: does the subset X generate the algebra A? In particular, we consider the question of minimal generating sets and the existence of a generating set of a given cardinality. In addition to questions such as these, it is sometimes of interest to ask about the role an individual element can play in the generation of an algebra. Schmid [28] suggests classifying elements as generators, nongenerators and irreducibles. To explain these, we need the notion of the Frattini subuniverse of an algebra. The Frattini subgroup has played an important role in group theory since it was first considered by Giovanni Frattini in 1885 [10]. It was observed quite some time ago that most of the basic properties of the Frattini subgroup hold more generally in any algebraic structure. Numerous papers have discussed Frattini sublattices. For a sample, see [1, 2, 9, 27]. There are 2000 Mathematics Subject Classification. 68Q17, 08A30, 20D25.
منابع مشابه
Context-Free Languages
Introduction 1 1 Languages 3 1.1 Notation and examples . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.1 Grammars . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.2 Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 1.1.3 Ambiguity . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 1.1.4 Reduced grammars, normal forms . . . . . . . . . . . . . . . 6 1.1...
متن کاملA Bound for the Nilpotency Class of a Lie Algebra
In the present paper, we prove that if L is a nilpotent Lie algebra whose proper subalge- bras are all nilpotent of class at most n, then the class of L is at most bnd=(d 1)c, where b c denotes the integral part and d is the minimal number of generators of L.
متن کاملReduction of Computational Complexity in Finite State Automata Explosion of Networked System Diagnosis (RESEARCH NOTE)
This research puts forward rough finite state automata which have been represented by two variants of BDD called ROBDD and ZBDD. The proposed structures have been used in networked system diagnosis and can overcome cominatorial explosion. In implementation the CUDD - Colorado University Decision Diagrams package is used. A mathematical proof for claimed complexity are provided which shows ZBDD ...
متن کاملOnline Aggregation of Coherent Generators Based on Electrical Parameters of Synchronous Generators
This paper proposes a novel approach for coherent generators online clustering in a large power system following a wide area disturbance. An interconnected power system may become unstable due to severe contingency when it is operated close to the stability boundaries. Hence, the bulk power system controlled islanding is the last resort to prevent catastrophic cascading outages and wide area bl...
متن کاملNumerical Study on Improvement of Hydrofoil Performance using Vortex Generators (RESEARCH NOTE)
In this paper the effects of rigid triangular passive vortex generators on a hydrofoil were investigated numerically. In the first step using the Finite Volume Method the bare hydrofoil were modeled and the results of lift and drag coefficients were validated using experimental data. In the next step the hydrofoil armed with vortex generators was modeled and its effect on the hydrofoil perfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IJAC
دوره 12 شماره
صفحات -
تاریخ انتشار 2002